Project-Team:CARAMBA

Project-Team Caramba

Team, Visitors, External Collaborators

Overall Objectives

Overall Objectives
Scientific Grounds

Research Program

The Extended Family of the Number Field Sieve
Algebraic Curves in Cryptology
Symmetric Cryptography
Computer Arithmetic
Polynomial Systems

Application Domains

Better Awareness and Avoidance of Cryptanalytic Threats
Promotion of Better Cryptography
Key Software Tools

Highlights of the Year

New Software and Platforms

Belenios
CADO-NFS
rrspace
Platforms

New Results

A new family of pairing-friendly elliptic curves
Faster individual discrete logarithms in finite fields of composite extension degree
Polynomial Time Bounded Distance Decoding near Minkowski's Bound in Discrete Logarithm Lattices
Improved complexity bounds for counting points on hyperelliptic curves
Counting points on genus-3 hyperelliptic curves with explicit real multiplication
Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus
A fast randomized geometric algorithm for computing Riemann-Roch spaces
Formal proof of mpfr_add
Various ways to split a floating-point number
A polyhedral method for sparse systems with many positive solutions
Fast Integer Multiplication Using Generalized Fermat Primes
Improved Methods for Finding Optimal Formulae for Bilinear Maps in a Finite Field
Using Constraint Programming to Solve a Cryptanalytic Problem
Preparation of a submission for the NIST call dedicated to standardization of lightweight cryptography

Bilateral Contracts and Grants with Industry

Bilateral Contracts with Industry
Bilateral Grants with Industry

Partnerships and Cooperations

Regional Initiatives
National Initiatives

Dissemination

Promoting Scientific Activities
Teaching - Supervision - Juries
Popularization

Bibliography

Publications of the year
References in notes

Inria | Raweb 2018 | Presentation of the Project-Team CARAMBA | CARAMBA Web Site


	PDF	e-Pub

Previous |

Home | Next next

Section: New Results

A new family of pairing-friendly elliptic curves

Participant : Aurore Guillevic.

In [11], together with M. Scott from Miracl, we presented an algorithm to generate new families of pairing-friendly curves. It generalizes the very popular Barreto-Naehrig curves. This paper jointly received the best paper award of the conference.

Previous |

Home | Next next